ML-Style Multi-Abstraction Calculus with Type Inference Algorithm
نویسندگان
چکیده
منابع مشابه
Principal Type Inference for GHC-Style Multi-parameter Type Classes
We observe that the combination of multi-parameter type classes with existential types and type annotations leads to a loss of principal types and undecidability of type inference. This may be a surprising fact for users of these popular features. We conduct a concise investigation of the problem and are able to give a type inference procedure which, if successful, computes principal types unde...
متن کاملA modern eye on ML type inference
Hindley and Milner’s type system is at the heart of programming languages such as Standard ML, Objective Caml, and Haskell. Its expressive power, as well the existence of a type inference algorithm, have made it quite successful. Traditional presentations of this algorithm, such as Milner’s AlgorithmW , are somewhat obscure. These short lecture notes, written for the APPSEM’05 summer school, be...
متن کاملTowards an ML-Style Polymorphic Type System for C
Advanced polymorphic type systems have come to play an important role in the world of functional programming. But, curiously, these type systems have so far had little impact upon widely-used imperative programming languages like C and C++. We show that ML-style polymorphism can be integrated smoothly into a dialect of C, which we call Polymorphic C. It has the same pointer operations as C, inc...
متن کاملFull Abstraction for Reduced ML
We present the first effectively presentable fully abstract model for Stark’s Reduced ML, the paradigmatic higher-order programming language combining call-by-value evaluation and integer-valued references. The model is constructed using techniques of nominal game semantics. Its distinctive feature is the presence of carefully restricted information about the store in plays, combined with condi...
متن کاملType Inference for a Distributed π-Calculus
We study the type inference problem for a distributed πcalculus with explicit notions of locality and migration. Location types involve names that may be bound in terms. This requires some accurate new treatments. We define a notion of principal typing. We provide a formal description of sound and complete type inference algorithm.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2019
ISSN: 1549-3636
DOI: 10.3844/jcssp.2019.745.757